/* list.c: classical linked list (of integer) */
 
/* standard header */
#include <stdlib.h>
#include <stdio.h>
 
/* our own header */
#include "list.h"
 
/* the hidden list inner struct */
 
struct s_list
{
	  list  next;
	  int	content;
};
 
/* usual operations */
 
/* list_len(l) return the size of the list */
size_t list_len (list l)
{
	size_t i = 1;
	while (l)
	{
		l = l->next;
		i++;
	}
	return i;
}
 
/* list_add(l,x) return a list with head x and tail l */
list list_add (list l, int x)
{
	  /* FIX ME */
}
 
 
/* list_destroy(l) completely free every element of l */
void    list_destroy    (list l)
{
	  /* FIX ME */
}
 
 
/* list_print(l) print every element in l *
 *  * with format: [ x0; ..; xn; ]           */
void    list_print(list l)
{
	  /* FIX ME */
}
 
/* list.c : end */

